منابع مشابه
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that is, genes that are colocalised in several species, indicating that they remained grouped during evolution. A second largely studied problem related to gene order data is to compute a minimum scenario of reversals that...
متن کاملDevelopmental Reversals in Attention
One of the law-like regularities of psychological science is that of developmental progression – an increase in sensorimotor, cognitive, and social functioning from childhood to adulthood. Here we report a rare violation of this law – a developmental reversal in attention. In Experiment 1, 4to-5-year-olds (N= 34) and adults (N = 35) performed a change detection task that included externally cue...
متن کاملRevealed Reversals of Preferences
We weaken the implicit assumption of rational choice theory that imposes that preferences do not depend on the choice set. We concentrate on the cases where the preferences change monotonically when the choice set expands. We show that rationalizability is then equivalent to state the usual strong axiom of revealed preferences to the binary relation of "revealed reversals of preferences".
متن کاملPreference Reversals Under Ambiguity
Preference reversals have been widely studied using risky or riskless gambles. However, little is known about preference reversals under ambiguity. We asked subjects to make a binary choice between ambiguous P-bets and ambiguous $-bets and elicited their willingness to accept. Subjects then performed the same two tasks with risky bets, where the probability of winning for a given risky bet is t...
متن کاملSorting by Prefix Reversals
The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Linguistics
سال: 2007
ISSN: 0022-2267,1469-7742
DOI: 10.1017/s0022226706004440